Comparison Training for Computer Chinese Chess

نویسندگان

  • Wen-Jie Tseng
  • Jr-Chang Chen
  • I-Chen Wu
  • Ting-Han Wei
چکیده

This paper describes the application of comparison training (CT) for automatic feature weight tuning, with the final objective of improving the evaluation functions used in Chinese chess programs. First, we propose an n-tuple network to extract features, since n-tuple networks require very little expert knowledge through its large numbers of features, while simulta-neously allowing easy access. Second, we propose a novel evalua-tion method that incorporates tapered eval into CT. Experiments show that with the same features and the same Chinese chess program, the automatically tuned comparison training feature weights achieved a win rate of 86.58% against the weights that were hand-tuned. The above trained version was then improved by adding additional features, most importantly n-tuple features. This improved version achieved a win rate of 81.65% against the trained version without additional features.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computer Chinese Chess

This article describes the current state of computer Chinese chess (Xiang Qi). For two reasons, Chinese-chess programming is important in the field of Artificial Intelligence. First, Chinese chess is one of the most popular and oldest board games worldwide; currently the strength of a Chinesechess program can be compared to that of human players. Second, the complexity of Chinese chess is betwe...

متن کامل

Chinese-Chess Image Recognition by using Feature Comparison Techniques

In this paper, we develop a feature comparison method for the Chinese-chess object by using the features comparison based on input image and database. Features are generated by calculating the distance between the contour of the character and the centre of the chess object. In this paper, the noise filter, object extraction, normalization, feature calculation (FC) and maximum energy slop (MES) ...

متن کامل

Abstracting Knowledge from Annotated Chinese-Chess Game Records

ing Knowledge from Annotated Chinese-Chess Game Records Bo-Nian Chen , Pangfang Liu, Shun-Chin Hsu, and Tsan-sheng Hsu 1 Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan {r92025,pangfeng}@csie.ntu.edu.tw 2 Department of Information Management, Chang Jung Christian University, Tainan, Taiwan [email protected] 3 Institute of Information Sc...

متن کامل

Chinese Dark Chess

Chinese dark chess is a popular and easy-to-learn game in Asia. The characteristic of possible revealing of unknown pieces makes it different from Chinese chess or Western chess. Players with luck may win a game by chance. Thus, there is a probabilistic behavior that a player has to consider. Computer Chinese dark chess problems can be divided into three phases: 1) the opening game, 2) the midd...

متن کامل

Selective Extensions in Game-Tree Search †

Although most of today’s chess playing programs still adopt a brute-force approach in their search region, much has been done on search extensions to make the effort spent more worthwhile. In this paper, we discuss some successful search extension heuristics in the domain of Chinese Chess, a game that bears much resemblance to chess. We restrict our experiments to the following: knowledge searc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1801.07411  شماره 

صفحات  -

تاریخ انتشار 2018